منابع مشابه
An Improved Robot Path Planning Algorithm
Robot path planning is a NP problem; traditional optimization methods are not very effective to solve it. Traditional genetic algorithm trapped into the local minimum easily. Therefore, based on a simple genetic algorithm and combine the base ideology of orthogonal design method then applied it to the population initialization, using the intergenerational elite mechanism, as well as the introdu...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملRobot Path Planning Method Based on Improved Genetic Algorithm
This paper presents an improved genetic algorithm for mobile robot path planning. The algorithm uses artificial potential method to establish the initial population, and increases value weights in the fitness function, which increases the controllability of robot path length and path smoothness. In the new algorithm, a flip mutation operator is added, which ensures the individual population col...
متن کاملMobile Robot Path Planning Based on Improved Q Learning Algorithm
For path planning of mobile robot, the traditional Q learning algorithm easy to fall into local optimum, slow convergence etc. issues, this paper proposes a new greedy strategy, multi-target searching of Q learning algorithm. Don't need to create the environment model, the mobile robot from a single-target searching transform into multitarget searching an unknown environment, firstly, by the dy...
متن کاملAn Improved Cellular Automata-Based Model for Robot Path-Planning
Cellular automata (CA) are able to represent high complex phenomena and can be naturally simulated by digital processors due to its intrinsic discrete nature. CA have been recently considered for path planning in autonomous robotics. In this work we started by adapting a model proposed by Ioannidis et al. to deal with scenarios with a single robot, turning it in a more decentralized approach. H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TELKOMNIKA (Telecommunication Computing Electronics and Control)
سال: 2012
ISSN: 2302-9293,1693-6930
DOI: 10.12928/telkomnika.v10i4.850